Per-thread cycle accounting in multicore processors

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cache-Fair Thread Scheduling for Multicore Processors

We present a new operating system scheduling algorithm for multicore processors. Our algorithm reduces the effects of unequal CPU cache sharing that occur on these processors and cause unfair CPU sharing, priority inversion, and inadequate CPU accounting. We describe the implementation of our algorithm in the Solaris operating system and demonstrate that it produces fairer schedules enabling be...

متن کامل

Loop recreation for thread-level speculation on multicore processors

Inter-iteration dependences in loops can hinder loop-level parallelism. For some loops, existing thread-level speculation (TLS) techniques fail to expose their inherent loop-level parallelism, because some inter-iteration dependences are too costly to synchronize, predict, pre-compute and isolate. This paper presents a compiler technique called loop recreation to change the nature of some depen...

متن کامل

Resource Sharing Unpredictably Affects Per-thread Performance in Multithreaded Architectures, but System Software Assumes All Coexecuting Threads Make Equal Progress. Per-thread Cycle Accounting Addresses This Problem by Tracking Per-thread Progress Rates for Each Coexecuting Thread

......Multithreading and multicore processors seek to improve microprocessor utilization by sharing resources across multiple active threads. Although resource sharing increases overall system throughput, it also affects per-thread performance in unpredictable ways—that is, one thread might make faster progress than another and some threads might even starve. However, system software, such as a...

متن کامل

Supporting Transparent Thread Assignment in Heterogeneous Multicore Processors Using Reinforcement Learning

Heterogeneity in multicore processor systems creates challenges in effectively mapping processes to diverse cores. While most approaches require programmer partitioning between core types or permutation of thread schedules to find the optimal mapping, we introduce a new machine learning approach to automated thread assignment. We train a reinforcement learning agent to assign threads to the bes...

متن کامل

Paging for Multicore Processors

Paging for multicore processors extends the classical paging problem to a setting in which several processes simultaneously share the cache. Recently, Hassidim [16] studied cache eviction policies for multicores under the traditional competitive analysis metric, showing that LRU is not competitive against an offline policy that has the power of arbitrarily delaying request sequences to its adva...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM Transactions on Architecture and Code Optimization

سال: 2013

ISSN: 1544-3566,1544-3973

DOI: 10.1145/2400682.2400688